TSTP Solution File: SET014^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET014^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:17:20 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 16 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 57 ( 7 ~; 8 |; 5 &; 29 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 16 ( 0 ^ 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > $o ).
thf(decl_23,type,
epred2_0: a > $o ).
thf(decl_24,type,
epred3_0: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(cBOOL_PROP_32_pme,conjecture,
! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X1 @ X4 )
| ( X2 @ X4 ) )
=> ( X3 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XxRjvZQL7u/E---3.1_10412.p',cBOOL_PROP_32_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X1 @ X4 )
| ( X2 @ X4 ) )
=> ( X3 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[cBOOL_PROP_32_pme]) ).
thf(c_0_2,negated_conjecture,
! [X14: a,X15: a] :
( ( ~ ( epred1_0 @ X14 )
| ( epred3_0 @ X14 ) )
& ( ~ ( epred2_0 @ X15 )
| ( epred3_0 @ X15 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ~ ( epred3_0 @ esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X4: a] :
( ( epred3_0 @ X4 )
| ~ ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
~ ( epred3_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: a] :
( ( epred3_0 @ X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
epred1_0 @ esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET014^5 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:01:50 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.XxRjvZQL7u/E---3.1_10412.p
% 0.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.49 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.49 # new_bool_9 with pid 10492 completed with status 0
% 0.21/0.49 # Result found by new_bool_9
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.49 # Search class: HGUNF-FFSF00-SSSFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting sh3 with 163s (1) cores
% 0.21/0.49 # sh3 with pid 10499 completed with status 0
% 0.21/0.49 # Result found by sh3
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.49 # Search class: HGUNF-FFSF00-SSSFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting sh3 with 163s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 2
% 0.21/0.49 # Removed by relevancy pruning/SinE : 1
% 0.21/0.49 # Initial clauses : 4
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 4
% 0.21/0.49 # Processed clauses : 9
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 9
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 1
% 0.21/0.49 # Generated clauses : 2
% 0.21/0.49 # ...of the previous two non-redundant : 1
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 2
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 1
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 4
% 0.21/0.50 # Positive orientable unit clauses : 1
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 2
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 5
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 389
% 0.21/0.50 # Search garbage collected termcells : 154
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.004 s
% 0.21/0.50 # Maximum resident set size: 1808 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1712 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------